Dissimilarity-Based Classifications in Eigenspaces
نویسندگان
چکیده
This paper presents an empirical evaluation on a dissimilarity measure strategy by which dissimilarity-based classifications (DBCs) [10] can be efficiently implemented. In DBCs, classifiers are not based on the feature measurements of individual objects, but rather on a suitable dissimilarity measure among the objects. In image classification tasks, however, one of the most intractable problems to measure the dissimilarity is the distortion and lack of information caused by the differences in illumination and directions and outlier data. To overcome this problem, in this paper, we study a new way of performing DBCs in eigenspaces spanned, one for each class, by the subset of principal eigenvectors, extracted from the training data set through a principal component analysis. Our experimental results, obtained with well-known benchmark databases, demonstrate that when the dimensionality of the eigenspaces has been appropriately chosen, the DBCs can be improved in terms of classification accuracies.
منابع مشابه
On Using Class-dependent Principle Component Analysis for Dissimilarity-Based Classifications
The aim of this paper 1 is to present an empirical evaluation on using class-dependent principle component analysis (PCA) for dissimilarity-based classifications (DBC) [18]. In DBC, the classification performance relies heavily on how well the dissimilarity space is constructed. In this paper, we study a way of constructing it in eigenspaces, spanned by the subset of principal eigenvectors, ext...
متن کاملAn Empirical Comparison of Kernel-Based and Dissimilarity-Based Feature Spaces
The aim of this paper is to find an answer to the question: What is the difference between dissimilarity-based classifications(DBCs) and other kernelbased classifications(KBCs)? In DBCs [11], classifiers are defined among classes; they are not based on the feature measurements of individual objects, but rather on a suitable dissimilarity measure among them. In KBCs [15], on the other hand, clas...
متن کاملOn Improving Dissimilarity-Based Classifications Using a Statistical Similarity Measure
The aim of this paper is to present a dissimilarity measure strategy by which a new philosophy for pattern classification pertaining to dissimilaritybased classifications (DBCs) can be efficiently implemented. In DBCs, classifiers are not based on the feature measurements of individual patterns, but rather on a suitable dissimilarity measure among the patterns. In image classification tasks, su...
متن کاملAn Inexact Graph Comparison Approach in Joint Eigenspace
In graph comparison, the use of (dis)similarity measurements between graphs is an important topic. In this work, we propose an eigendecomposition based approach for measuring dissimilarities between graphs in the joint eigenspace (JoEig). We will compare our JoEig approach with two other eigendecomposition based methods that compare graphs in different eigenspaces. To calculate the dissimilarit...
متن کاملDissimilarity Representations Using lp-norms in Eigen Spaces
This paper presents an empirical evaluation on a dissimilarity measure strategy by which dissimilarity-based classifications (DBC) can be implemented efficiently. In DBC, classification is not based on feature measurements of individual objects (a set of attributes), but rather on a suitable dissimilarity measure among the individual objects (pair-wise object comparisons). One problem of DBC is...
متن کامل